An Attack on a Non-Interactive Key Exchange from Code Equivalence
نویسندگان
چکیده
Abstract A recent paper by Zhang and claims to construct the first code-based non-interactive key exchange protocol, using a modified version of Code Equivalence Problem. In this we explain why approach is flawed. Namely, describe an attack which involves only linear algebra completely breaks protocol with overwhelming probability. simple Magma script confirms our results.
منابع مشابه
Non-Interactive Key Exchange
Non-interactive key exchange (NIKE) is a fundamental but much-overlooked cryptographic primitive. It appears as a major contribution in the ground-breaking paper of Diffie and Hellman, but NIKE has remained largely unstudied since then. In this paper, we provide different security models for this primitive and explore the relationships between them. We then give constructions for secure NIKE in...
متن کاملA Lightweight Generic Compiler for Authenticated Key Exchange from Non-interactive Key Exchange with Auxiliary Input
We introduce a new lightweight generic compiler that is able to transform any passively forward secure twomessage key exchange (KE) protocols into authenticated key exchange (AKE) protocols with security in the presence of active adversaries who can reveal critical session specific information such as long-term or ephemeral secrets and can establish malicious parties. The compiler is built base...
متن کاملAn active attack on a distributed Group Key Exchange system
In this work, we introduce an active attack on a Group Key Exchange protocol by Burmester and Desmedt. The attacker obtains a copy of the shared key, which is created in a collaborative manner with the legal users in a communication group.
متن کاملAn Active Attack on a Multiparty Key Exchange Protocol
The multiparty key exchange introduced in Steiner et al. and presented in more general form by the authors is known to be secure against passive attacks. In this paper, an active attack is presented assuming malicious control of the communications of the last two users for the duration of only the key exchange.
متن کاملUniversally Composable Non-Interactive Key Exchange
We consider the notion of a non-interactive key exchange (NIKE). A NIKE scheme allows a party A to compute a common shared key with another party B from B’s public key and A’s secret key alone. This computation requires no interaction between A and B, a feature which distinguishes NIKE from regular (i.e., interactive) key exchange not only quantitatively, but also qualitatively. Our first contr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tatra mountains mathematical publications
سال: 2022
ISSN: ['1210-3195', '1338-9750']
DOI: https://doi.org/10.2478/tmmp-2022-0018